Robust surface normal estimation via greedy sparse regression
نویسندگان
چکیده
منابع مشابه
Robust Estimation in Linear Regression with Molticollinearity and Sparse Models
One of the factors affecting the statistical analysis of the data is the presence of outliers. The methods which are not affected by the outliers are called robust methods. Robust regression methods are robust estimation methods of regression model parameters in the presence of outliers. Besides outliers, the linear dependency of regressor variables, which is called multicollinearity...
متن کاملStructured Sparse Regression via Greedy Hard Thresholding
Several learning applications require solving high-dimensional regression problems where the relevant features belong to a small number of (overlapping) groups. For very large datasets and under standard sparsity constraints, hard thresholding methods have proven to be extremely efficient, but such methods require NP hard projections when dealing with overlapping groups. In this paper, we show ...
متن کاملRobust and Sparse Regression via γ-Divergence
In high-dimensional data, many sparse regression methods have been proposed. However, they may not be robust against outliers. Recently, the use of density power weight has been studied for robust parameter estimation, and the corresponding divergences have been discussed. One such divergence is the γ-divergence, and the robust estimator using the γ-divergence is known for having a strong robus...
متن کاملEfficient Variation Decomposition via Robust Sparse Regression
In this work, we propose a new technique to accurately decompose process variation into lot‐ to‐lot, wafer‐to‐wafer, wafer‐level spatially correlated, wafer‐level random, within‐die spatially correlated and within‐die random variation components. Performing such variation decomposition narrows down the main variation sources in the manufacturing process, and offers valuable information for proc...
متن کاملSparse Greedy Gaussian Process Regression
Peter Bartlett RSISE Australian National University Canberra, ACT, 0200 [email protected] We present a simple sparse greedy technique to approximate the maximum a posteriori estimate of Gaussian Processes with much improved scaling behaviour in the sample size m. In particular, computational requirements are O(n2m), storage is O(nm), the cost for prediction is 0 ( n) and the cost to com...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: EURASIP Journal on Image and Video Processing
سال: 2015
ISSN: 1687-5281
DOI: 10.1186/s13640-015-0098-x